DRAFT The Median Voter Maximizes Satisfaction and Minimizes Polarization: Worldwide Evidence Since the 19th Century

The Politics of Consumption Taxes: Globalization and the Median Voter

The regressive nature of consumption taxes poses a challenge to partisan theory. Using data for up to 20 OECD countries in the period 1970-2003 this article aims to explore the question of whether the idea that social democratic governments typically have to compromise on policy goals and core constituency interests to make themselves more appealing to the median voter necessitates the use of r...

The Chronicle of Arsenic Poisoning in the 19th Century

The position of Persian language and literature in Ottoman’s 19th century literature and historical developments

With the spread of western reforms in the 13th/9th century, Ottoman’s literature was reformed either. To reform Ottoman literature, they decided to transform the Ottoman language and literature relations with Persian language and literature. On one hand, they considered problems of Ottoman literature regarding Pindaric and its inefficiency for entering new areas such as novel, drama, and journa...

A.P. Chekhov’s Works in Interpretation by F.E. Paktovsky

This paper presents a conceptual analysis of the essay by Paktovsky (1901) which concentrates on the works by Chekhov. The urgency of the research is determined by the significance of the literary figure for the history of Russian criticism of the 19th – 20th centuries, the importance of his vision concerning the writing of the authors of Russian literature of the turn of the century, as well a...

A note on maximizing the minimum voter satisfaction on spanning trees

A fair spanning tree of a graph maximizes the minimum satisfaction among individuals given their preferences over the edges of the graph. In this note we answer an open question about the computational complexity of determining fair spanning trees raised in Darmann et al. [8]. It is shown that the maximin voter satisfaction problem under choose-t-election is NP-complete for each fixed t ≥ 2.